Joint content placement and storage allocation based on federated learning in F-RANs

Funding: This work was supported in part by Innovation Project of the Common Key Technology of Chongqing Science and Technology Industry (cstc2018jcyjAX0383), the special fund of Chongqing key laboratory (CSTC), and the Funding of CQUPT (A2016-83, GJJY19-2-23, A2020-270).Peer reviewedPublisher PD

Adaptive Resource Allocation Algorithm in Wireless Access Network

Wireless network state varies with the surrounding environment, however, the existing resource allocation algorithm cannot adapt to the varying network state, which results to the underutilization of frequency and power resource. Therefore, in this paper, we propose an adaptive resource allocation algorithm which can efficiently adapt to the varying network state by building an optimal mathematical model and then changing the weighted value of the objective function. Furthermore, the optimal allocation of subcarrier and power is derived by using the Lagrange dual decomposition and the subgradient method. Simulation results show that the proposed algorithm can adaptively allocate the resource to the users according to the varying user density which represents the network state

Modelling and Performance Analysis of the Over-the-Air Computing in Cellular IoT Networks

Ultra-fast wireless data aggregation (WDA) of distributed data has emerged as a critical design challenge in the ultra-densely deployed cellular internet of things network (CITN) due to limited spectral resources. Over-the-air computing (AirComp) has been proposed as an effective solution for ultra-fast WDA by exploiting the superposition property of wireless channels. However, the effect of access radius of access point (AP) on the AirComp performance has not been investigated yet. Therefore, in this work, the mean square error (MSE) performance of AirComp in the ultra-densely deployed CITN is analyzed with the AP access radius. By modelling the spatial locations of internet of things devices as a Poisson point process, the expression of MSE is derived in an analytical form, which is validated by Monte Carlo simulations. Based on the analytical MSE, we investigate the effect of AP access radius on the MSE of AirComp numerically. The results show that there exists an optimal AP access radius for AirComp, which can decrease the MSE by up to 12.7%. It indicates that the AP access radius should be carefully chosen to improve the AirComp performance in the ultra-densely deployed CITN

A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric "the next-hop fitness" which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion

Analysis and Properties of Time-Varying Modified DFT Filter Banks

<p/> <p>We provide a comprehensive analysis of the time-varying modified DFT (MDFT) filter bank based on the general time-varying filter bank theories (Wang, 2005, 2006, 2008, 2009) in both the time domain and frequency domain. We give firstly the description of the time-invariant MDFT filter bank including its perfect reconstruction (PR) condition, its mechanism of aliasing error cancellation and the relationship with the cosine-modulated filter bank in detail. Then, the time-varying MDFT filter bank is analyzed according to the time-domain description. Finally, the window switching method is introduced to design the prototype filter in the time-varying MDFT filter bank with examples. The error analysis shows that the introduced design approach is useful in practice.</p